全文获取类型
收费全文 | 23364篇 |
免费 | 1651篇 |
国内免费 | 1052篇 |
专业分类
化学 | 1458篇 |
晶体学 | 31篇 |
力学 | 2473篇 |
综合类 | 300篇 |
数学 | 19374篇 |
物理学 | 2431篇 |
出版年
2024年 | 37篇 |
2023年 | 232篇 |
2022年 | 348篇 |
2021年 | 519篇 |
2020年 | 499篇 |
2019年 | 524篇 |
2018年 | 596篇 |
2017年 | 689篇 |
2016年 | 652篇 |
2015年 | 487篇 |
2014年 | 1024篇 |
2013年 | 1638篇 |
2012年 | 1209篇 |
2011年 | 1194篇 |
2010年 | 1087篇 |
2009年 | 1452篇 |
2008年 | 1489篇 |
2007年 | 1578篇 |
2006年 | 1338篇 |
2005年 | 1103篇 |
2004年 | 906篇 |
2003年 | 960篇 |
2002年 | 843篇 |
2001年 | 677篇 |
2000年 | 684篇 |
1999年 | 572篇 |
1998年 | 559篇 |
1997年 | 507篇 |
1996年 | 361篇 |
1995年 | 355篇 |
1994年 | 263篇 |
1993年 | 224篇 |
1992年 | 215篇 |
1991年 | 182篇 |
1990年 | 152篇 |
1989年 | 99篇 |
1988年 | 88篇 |
1987年 | 77篇 |
1986年 | 78篇 |
1985年 | 105篇 |
1984年 | 101篇 |
1983年 | 40篇 |
1982年 | 51篇 |
1981年 | 46篇 |
1980年 | 35篇 |
1979年 | 50篇 |
1978年 | 36篇 |
1977年 | 46篇 |
1976年 | 28篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
41.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
42.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
43.
44.
45.
Cai Xiaochun 《Annals of Differential Equations》2006,22(1):1-6
In this paper, we apply a critical point theorem and obtain the condition for the existence of three solutions to two-point boundary value problem of a second order nonlinear difference equation. 相似文献
46.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
47.
48.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
49.
50.
具有模糊数的模糊多目标群体决策优选模型与方法 总被引:5,自引:0,他引:5
多目标群体决策问题是运筹学的一个重要研究领域,目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多,本对此类模糊多目标群体决策问题进行了探讨,利用相对正理想方案与相对负理想方案概念定义了相对差异距离,进而建立了模糊多目标群体决策优选模型与方法,并通过战役决心方案的评价说明了该方法是可行、有效的,可作为军事决策与决策支持系统的备选方法。 相似文献